Car-like Robots and Moving Obstacles Car-like Robots and Moving Obstacles
نویسندگان
چکیده
| This paper addresses motion planning for a car-like robot moving in a changing planar workspace, i.e. with moving obstacles. First, this motion planning problem is formulated in the state-time space framework. The state-time space of a robot is its state space plus the time dimension. In this framework part of the constraints at hand are translated into static forbidden regions of state-time space, and a trajectory maps to a state-time curve which must respect the remaining constraints. Then an approximate solution to the problem is presented. Abstract | This paper addresses motion planning for a car-like robot moving in a changing planar workspace, i.e. with moving obstacles. First, this motion planning problem is formulated in the state-time space framework. The state-time space of a robot is its state space plus the time dimension. In this framework part of the constraints at hand are translated into static forbidden regions of state-time space, and a trajectory maps to a state-time curve which must respect the remaining constraints. Then an approximate solution to the problem is presented.
منابع مشابه
مسیریابی حرکت روباتهای ماشینواره با روش پیشروی سریع
The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...
متن کاملA Collision Checker for Car-Like Robots Coordination
This paper presents a geometric algorithm dealing with collision checking in the framework of multiple mobile robot coordination. We consider that several mobile robots have planned their own collision-free path by taking into account the obstacles, but ignoring the presence of other robots. We rst compute the domain swept by each robot when moving along its path; such a domain is called a trac...
متن کاملObstacle Distances and Visibility for Car-Like Robots Moving Forward
This paper deals with distance computation between a car-like robot moving only forward and polygonal obstacles. We propose eecient geometric algorithms to compute the shortest paths to obstacles. We then derive the \visibility" domain in the presence of obstacles , i.e. the set of positions reachable from a starting connguration, by a collision-free shortest path unaffected by the presence of ...
متن کاملGeneralized reciprocal collision avoidance
Reciprocal collision avoidance has become a popular area of research over recent years. Approaches have been developed for a variety of dynamic systems ranging from single integrators to car-like, differential-drive, and arbitrary, linear equations of motion. In this paper, we present two contributions. First, we provide a unification of these previous approaches under a single, generalized rep...
متن کاملThe use of Obstacle Motion Tracking for Car-like Mobile Robots Collision Avoidance in Dynamic Urban Environments
One of the most challenging tasks for mobile robots is to track mobile obstacles that surround them. This task is especially difficult in outdoor environments where a great variety of obstacles may induce the robot to take erroneous decisions. The mobile robot needs as much information as possible concerning the obstacle positions and speeds (direction and magnitude) in order to plan evasive ma...
متن کامل